Step of Proof: let_wf
9,38
postcript
pdf
Inference at
*
1
I
of proof for Lemma
let
wf
:
1.
A
: Type
2.
B
: Type
3.
a
:
A
4.
b
:
A
B
(
x
.
b
(
x
))(
a
)
B
latex
by % (Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 1000:n)) (first_tok :t) inil_term)
b
should have got this, but type inf failed
on untyped lambda... %
Reduce 0
latex
Re
1
:
Re1:
b
(
a
)
B
Re
.
origin